全文获取类型
收费全文 | 4583篇 |
免费 | 717篇 |
国内免费 | 498篇 |
专业分类
电工技术 | 486篇 |
技术理论 | 1篇 |
综合类 | 493篇 |
化学工业 | 41篇 |
金属工艺 | 45篇 |
机械仪表 | 232篇 |
建筑科学 | 251篇 |
矿业工程 | 71篇 |
能源动力 | 60篇 |
轻工业 | 29篇 |
水利工程 | 104篇 |
石油天然气 | 34篇 |
武器工业 | 17篇 |
无线电 | 989篇 |
一般工业技术 | 294篇 |
冶金工业 | 83篇 |
原子能技术 | 12篇 |
自动化技术 | 2556篇 |
出版年
2024年 | 22篇 |
2023年 | 70篇 |
2022年 | 175篇 |
2021年 | 191篇 |
2020年 | 221篇 |
2019年 | 139篇 |
2018年 | 136篇 |
2017年 | 153篇 |
2016年 | 224篇 |
2015年 | 234篇 |
2014年 | 363篇 |
2013年 | 323篇 |
2012年 | 372篇 |
2011年 | 458篇 |
2010年 | 341篇 |
2009年 | 317篇 |
2008年 | 333篇 |
2007年 | 369篇 |
2006年 | 322篇 |
2005年 | 221篇 |
2004年 | 193篇 |
2003年 | 142篇 |
2002年 | 122篇 |
2001年 | 86篇 |
2000年 | 61篇 |
1999年 | 49篇 |
1998年 | 31篇 |
1997年 | 29篇 |
1996年 | 20篇 |
1995年 | 7篇 |
1994年 | 14篇 |
1993年 | 11篇 |
1992年 | 2篇 |
1991年 | 8篇 |
1990年 | 3篇 |
1989年 | 4篇 |
1988年 | 3篇 |
1986年 | 3篇 |
1985年 | 5篇 |
1982年 | 1篇 |
1981年 | 3篇 |
1979年 | 2篇 |
1978年 | 3篇 |
1977年 | 1篇 |
1976年 | 7篇 |
1974年 | 1篇 |
1973年 | 1篇 |
1972年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有5798条查询结果,搜索用时 15 毫秒
1.
主要对各国3G许可证与使用技术标准的抽绑政策.各国对2G/3G网络漫游的管制规定。以及3G网络之间共享的种类及实施方式等方面做了详尽的讲解,并进行比较和分析。 相似文献
2.
3.
国内3G网络共享问题之研究 总被引:2,自引:0,他引:2
随着国内3G时代的来临,3G网络共享问题越来越受到人们的关注。本文结合国内移动通信的现状,着重分析了3G网络共享的模式及经济效益,论述了3G网络共享的相应策略。 相似文献
4.
本文介绍了IBM-PC系列计算机通过RS-232C串行口与多个单片微机组成的分布式系统中一种可双向选通串行通信共享器的设计方法。给出通信共享器的设计电路;并对电路工作原理进行了详细剖析。 相似文献
5.
节能降耗提高矿山效益 总被引:1,自引:0,他引:1
节能降耗是每一个矿山提高经济效益的有效途径。我们采取提高球磨机处理能力,降低单耗;利用“分时计价”政策,采用“避峰作业”;使用新设备等措施节能降耗,提高矿山经济效益。 相似文献
6.
We present some new lower bounds on the optimal information rate and on the optimal average information rate of secret sharing schemes with homogeneous access structure. These bounds are found by using some covering constructions and a new parameter, the k-degree of a participant, that is introduced in this paper. Our bounds improve the previous ones in almost all cases. 相似文献
7.
基于多智能体的数控机床资源共享技术研究 总被引:8,自引:1,他引:7
以数控铣床为对象,应用多智能体技术,以解决传统的资源共享所面lI缶的透明度低和效率低下的问题。首先,在分析功能模型的基础上,提出并实现了资源共享的四层网络拓扑结构;其次,构造了面向设备资源共享功能的智能体信息流模型,以实现四层结构之间的交互;其三,定义了智能体状态函数,并以此为依据,建立了智能体协商机制。所开发的原型系统表明,以上成果有效地提高了数控机床资源共享的透明度和效率。 相似文献
8.
The mobile agent is a fundamental building block of the mobile computing paradigm. In mobile agent security, oblivious transfer
(OT) from a trusted party can be used to protect the agent’s privacy and the hosts’ privacy. In this paper, we introduce a
new cryptographic primitive called Verifiable Distributed Oblivious Transfer (VDOT), which allows us to replace a single trusted party with a group of threshold trusted servers. The design of VDOT uses a novel
technique called consistency verification of encrypted secret shares. VDOT protects the privacy of both the sender and the receiver against malicious attacks of the servers. We also show the
design of a system to apply VDOT to protect the privacy of mobile agents. Our design partitions an agent into the general
portion and the security-sensitive portion. We also implement the key components of our system. As far as we know, this is
the first effort to implement a system that protects the privacy of mobile agents. Our preliminary evaluation shows that protecting
mobile agents not only is possible, but also can be implemented efficiently.
This work was supported in part by the DoD University Research Initiative (URI) program administered by the Office of Naval
Research under grant N00014-01-1-0795. Sheng Zhong was supported by ONR grant N00014-01-1-0795 and NSF grants ANI-0207399
and CCR-TC-0208972. Yang Richard Yang was supported in part by NSF grant ANI-0207399. A preliminary version of this paper
was presented at the DialM-POMC Joint Workshop on Foundations of Mobile Computing in 2003.
Sheng Zhong received his Ph.D. in computer science from Yale University in the year of 2004. He holds an assistant professor position
at SUNY Buffalo and is currently on leave for postdoctoral research at the Center for Discrete Mathematics and Theoretical
Computer Science (DIMACS). His research interests, on the practical side, are security and incentives in data mining, databases,
and wireless networks. On the theoretical side, he is interested in cryptography and game theory.
Yang Richard Yang is an Assistant Professor of Computer Science at Yale University. His research interests include computer networks, mobile
computing, wireless networking, sensor networks, and network security. He leads the LAboratory of Networked Systems (LANS)
at Yale. His recent awards include a Schlumberger Fellowship and a CAREER Award from the National Science Foundation. He received
his B.E. degree from Tsinghua University (1993), and his M.S. and Ph.D. degrees from the University of Texas at Austin (1998
and 2001). 相似文献
9.
从ZnO电阻的非线性特性出发,对采用ZnO作为灭磁电阻时阀片的均流/均能进行理论论述,指出阀片均能性能的好坏主要依赖于阀片自身的特性;分析比较了ZnO阀片的不同选择方法对均流/均能的影响,指出阀片的均流/均能很大程度上取决于可供选择的阀片的库存量.该研究为发电机励磁系统的安全稳定运行提供了有力的保证. 相似文献
10.
Stochastic analysis of file-swarming systems 总被引:1,自引:0,他引:1
File swarming (or file sharing) is one of the most important applications in P2P networks. In this paper, we propose a stochastic framework to analyze a file-swarming system under realistic setting: constraints in upload/download capacity, collaboration among peers and incentive for chunk exchange. We first extend the results in the coupon system [L. Massoulie, M. Vojnovic, Coupon replication systems, in: Proc. ACM SIGMETRICS, Banff, Alberta, Canada, 2005] by providing a tighter performance bound. Then we generalize the coupon system by considering peers with limited upload and download capacity. We illustrate the last-piece problem and show the effectiveness of using forward error-correction (FEC) code and/or multiple requests to improve the performance. Lastly, we propose a framework to analyze an incentive-based file-swarming system. The stochastic framework we propose can serve as a basis for other researchers to analyze and design more advanced features of file-swarming systems. 相似文献